On Automorphisms of Polyadic Algebras

نویسنده

  • AUBERT DAIGNEAULT
چکیده

Introduction. This paper belongs to the theory of polyadic algebras as developed by Haimos [11-15], but it has a bearing on the theory of models. Two central concepts are those of homogeneous(2) and of normal extensions of a polyadic algebra (see the beginning of §2 and of §6). These concepts bear some resemblance to concepts of the theory of algebraic extensions of fields; however, we have been influenced more immediately by M. Krasner's general Galois theory [33-35] which can be given a polyadic interpretation. Aside from the short preliminary Chapter 0, the paper is divided into sections grouped into three chapters. Each section begins by an outline of its contents. We proceed to an analysis of the main results of the paper. All polyadic algebras considered are locally finite of infinite degree. The highlights of Chapter 1 are: (i) the possibility of extending any simple extension of a (simple polyadic) algebra to a simple homogeneous and normal extension (Corollary 4.6); (ii) a first step on a Galois theory (Theorem 4.5) which, in the case of a full simple functional algebra with finite domain, takes a definite form (Theorem 4.7) closely related to Krasner's theory in that case; (iii) the existence and unicity of a+-universaI-homogeneous algebras in the sense of B. Jönsson [21; 22] in certain classes of polyadic algebras (Theorem 6.3, Theorem 6.6). The results in (iii) make use of Jönsson's work which is dependent on the continuum hypothesis (see also Theorem 5.5 which is independent of this hypothesis). Chapter II departs from the theme of automorphisms and uses little aside from Chapter 0 and §1. The main result here is Theorem 8.1 which gives a description of the functional representations of a full simple functional algebra in terms of a new generalization of the concept of reduced power. In Chapter III, we propose to show that the algebraic results of the first two chapters, when put together, embody several known model-theoretic results or new forms of such results. After a section devoted to the connections between Model theory and polyadic algebras, we give new proofs of Beth's theorem

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Amalgamation for Reducts of Polyadic Equality Algebras, a Negative Result

Let G ⊆ ω be a semigroup. G polyadic algebras with equality, or simply G algebras, are reducts of polyadic algebras with equality obtained by restricting the similarity type and axiomatization of polyadic algebras to substitutions in G, and possibly weakening the axioms governing diagonal elements. Such algebras were introduced in the context of ’finitizing’ first order logic with equality. We ...

متن کامل

Algebraic Logic Iv. Equality in Polyadic Algebras

Introduction. A standard way to begin the study of symbolic logic is to describe one after another the propositional calculus, the monadic functional calculus, the pure first-order functional calculus, and the functional calculus with equality. The algebraic aspects of these logical calculi belong to the theories of Boolean algebras, monadic algebras, polyadic algebras, and cylindric algebras r...

متن کامل

On the Equational Theory of Representable Polyadic Equality

Among others we will see that the equational theory of ω dimensional representable polyadic equality algebras (RPEAω’s) is not schema axiomatizable. This result is in interesting contrast with the Daigneault-Monk representation theorem, which states that the class of representable polyadic algebras is finite schema-axiomatizable (and hence the equational theory of this class is finite schemaaxi...

متن کامل

Amalgamation for Reducts of Polyadic Equality Algebras, both a Negative Result and a Positive Result

Let G ⊆ ωω be a semigroup. G polyadic algebras with equality, or simply G algebras, are reducts of polyadic algebras with equality obtained by restricting the similarity type and axiomatization of polyadic algebras to substitutions in G, and possibly weakening the axioms governing the diagonal elements. Such algebras were introduced in the context of ’finitizing’ first order logic with equality...

متن کامل

Bare canonicity of representable cylindric and polyadic algebras

We show that for finite n ≥ 3, every first-order axiomatisation of the varieties of representable n-dimensional cylindric algebras, diagonal-free cylindric algebras, polyadic algebras, and polyadic equality algebras contains an infinite number of non-canonical formulas. We also show that the class of structures for each of these varieties is non-elementary. The proofs employ algebras derived fr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010